Scientific Workflow Clustering Based on Motif Discovery
نویسندگان
چکیده
منابع مشابه
A Clustering Approach to Scientific Workflow Scheduling on the Cloud with Deadline and Cost Constraints
One of the main features of High Throughput Computing systems is the availability of high power processing resources. Cloud Computing systems can offer these features through concepts like Pay-Per-Use and Quality of Service (QoS) over the Internet. Many applications in Cloud computing are represented by workflows. Quality of Service is one of the most important challenges in the context of sche...
متن کاملClustering sequence sets for motif discovery
Most of existing methods for DNA motif discovery consider only a single set of sequences to find an over-represented motif. In contrast, we consider multiple sets of sequences where we group sets associated with the same motif into a cluster, assuming that each set involves a single motif. Clustering sets of sequences yields clusters of coherent motifs, improving signal-to-noise ratio or enabli...
متن کاملa clustering approach to scientific workflow scheduling on the cloud with deadline and cost constraints
one of the main features of high throughput computing systems is the availability of high power processing resources. cloud computing systems can offer these features through concepts like pay-per-use and quality of service (qos) over the internet. many applications in cloud computing are represented by workflows. quality of service is one of the most important challenges in the context of sche...
متن کاملEigenvector-based Relational Motif Discovery
The development of novel analytical tools to investigate the structure of music works is central in current music information retrieval research. In particular, music summarization aims at finding the most representative parts of a music piece (motifs) that can be exploited for an efficient music database indexing system. Here we present a novel approach for motif discovery in music pieces base...
متن کاملDiscovering larger network motifs: Network clustering for Network Motif discovery
We want to discover larger network motifs, with more than 15 number of nodes. In order to propose an algorithm for finding larger network motifs in any biological network, we review some of models and algorithms to find network motifs. There are two types of methods, one is exact counting and the other is approximate sampling. Generalization of random graphs is another important issue to evalua...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Science, Engineering and Information Technology
سال: 2017
ISSN: 2231-3605,2231-3117
DOI: 10.5121/ijcseit.2017.7401